Hash trie

In computer science, hash trie can refer to:

• A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory. (The name is suggested by a similarity to a closed hash table.) ^[1]
• An ordinary trie used to store hash values, for example, in an implementation of a hash tree.
• A data structure which "combines features of hash tables and LC-tries in order to perform efficient lookups and updates" ^[2]

References

1. ^ Liang, Frank (June 1983), Word hy-phen-a-tion by com-pu-ter, Frank M. Liang, Ph.D. thesis, Stanford University., http://www.tug.org/docs/liang/liang-thesis.pdf, retrieved 2010-03-28 
2. ^ Thomas, Roshan; Mark, Brian; Johnson, Tommy; Croall, James (2004), High-speed Legitimacy-based DDoS Packet Filtering with Network Processors: A Case Study and Implementation on the Intel IXP1200, http://napl.gmu.edu/pubs/BookContrib/ThomasMarkJC-NPW04.pdf, retrieved 2009-05-03